Correction to “Relative Observability of Discrete-Event Systems and Its Supremal Sublanguages”
نویسندگان
چکیده
منابع مشابه
Observability of Discrete Event Dynamic Systems
A finite state automaton is adopted as a model for Discrete Event Dynamic Systems (DEDS). Observations are assumed to be a subset of the event alphabet. Observability is defined as having perfect knowledge of the current state at points in time seperated by bounded numbers of transitions. A polynomial test for observability is given. It is shown that an observer may be constructed and implement...
متن کاملSupremal normal sublanguages in hierarchical supervisory control
In this paper, we study hierarchical supervisory control with partial observations. In particular, we are interested in preservation of supremal normal and supremal controllable and normal sublanguages from the abstracted system (high level) in the original (low level) system. Sufficient conditions are formulated under which the supremal normal or the supremal controllable and normal sublanguag...
متن کاملOn the computation of supremal sublanguages relevant to supervisory control
Given a specification language, this paper discusses an iterative procedure for the computation of the supremal sublanguage, that possesses a conjunction of certain closed-loop properties, including controllability, normality and completeness. The iteration is stated in terms of (i) supremal sublanguage operators for each individual property, (ii) prefix-closures, and, (iii) language intersecti...
متن کاملDecentralized prognosis of fuzzy discrete-event systems
This paper gives a decentralized approach to the problem of failure prognosis in the framework of fuzzy discrete event systems (FDES). A notion of co-predictability is formalized for decentralized prognosis of FDESs, where several local agents with fuzzy observability rather than crisp observability are used in the prognosis task. An FDES is said to be co-predictable if each faulty event can be...
متن کاملFormulas for Calculating Supremal Controllable and Normal Sublanguages
Supremal controllable and normal sublanguages have been shown to play an important role in supervisor synthesis. In this paper, we discuss the computation of supremal controllable and normal sublanguages. We derive formulas for both supremal controllable sublanguages and supremal normal sublanguages when the languages involved are closed. As a result, those languages can be computed without app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2017
ISSN: 0018-9286,1558-2523
DOI: 10.1109/tac.2016.2545867